Ramsey numbers involving graphs with large degrees
نویسندگان
چکیده
Let F be a graph of order v(F) ≥ 3 and size e(F), and let ρ(F) = (e(F) − 1)/(v(F) − 2). It is shown that if Gn is a graph of order n with average degree dn ≥ 2, then r(F ,Gn) ≥ c ( dn log dn )ρ(F) for all n, where c = c(F) > 0 is a constant. © 2009 Elsevier Ltd. All rights reserved.
منابع مشابه
The Ramsey numbers of large trees versus wheels
For two given graphs G1 and G2, the Ramseynumber R(G1,G2) is the smallest integer n such that for anygraph G of order n, either $G$ contains G1 or the complementof G contains G2. Let Tn denote a tree of order n andWm a wheel of order m+1. To the best of our knowledge, only R(Tn,Wm) with small wheels are known.In this paper, we show that R(Tn,Wm)=3n-2 for odd m with n>756m^{10}.
متن کاملRamsey numbers of ordered graphs
An ordered graph G< is a graph G with vertices ordered by the linear ordering <. The ordered Ramsey number R(G<, c) is the minimum number N such that every ordered complete graph with c-colored edges and at least N vertices contains a monochromatic copy of G<. For unordered graphs it is known that Ramsey numbers of graphs with degrees bounded by a constant are linear with respect to the number ...
متن کاملRamsey Numbers for Partially-ordered Sets
We present a refinement of Ramsey numbers by considering graphs with a partial ordering on their vertices. This is a natural extension of the ordered Ramsey numbers. We formalize situations in which we can use arbitrary families of partially-ordered sets to form host graphs for Ramsey problems. We explore connections to well studied Turán-type problems in partially-ordered sets, particularly th...
متن کاملRamsey numbers for bipartite graphs with small bandwidth
We estimate Ramsey numbers for bipartite graphs with small bandwidth and bounded maximum degree. In particular we determine asymptotically the two and three color Ramsey numbers for grid graphs. More generally, we determine the two color Ramsey number for bipartite graphs with small bandwidth and bounded maximum degree and the three color Ramsey number for such graphs with the additional assump...
متن کاملOn the Ramsey numbers for linear forest versus some graphs
For given graphs G and H; the Ramsey number R(G;H) is the leastnatural number n such that for every graph F of order n the followingcondition holds: either F contains G or the complement of F contains H.In this paper firstly, we determine Ramsey number for union of pathswith respect to sunflower graphs, For m ≥ 3, the sunflower graph SFmis a graph on 2m + 1 vertices obtained...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Appl. Math. Lett.
دوره 22 شماره
صفحات -
تاریخ انتشار 2009